Scheduling Jobs with a Limited Waiting Time Constraint on a Hybrid Flowshop

In this paper, we address a two-stage hybrid flowshop scheduling problem with identical parallel machines in each stage. The assumes that the queue (Q)-time for job, which represents waiting time to be processed current stage, must limited predetermined threshold due quality concerns final product. This is motivated by one occurs real field, especially diffusion workstation of semiconductor fabrication. Our objective minimize makespan jobs while considering product quality. To achieve goal, formulated mathematical programming, developed two dominance properties problem, and proposed three heuristics suggested solve considered problem. We conducted simulation experiments evaluate performance approaches using randomly generated instances are created closely resemble production scenarios, results demonstrate their superiority over existing methods. Furthermore, applied methods real-world setting within fabrication industry, where they have exhibited better compared dispatching rules commonly used practical applications. These findings validate effectiveness applicability our methodologies scenarios.